Local Labeling and Resource Allocation Using Preprocessing

This paper studies the power of non-restricted preprocessing on a communication graph G, in a synchronous, reliable system. In our scenario, arbitrary preprocessing can be performed on G, after which a sequence of labeling problems have to be solved on diierent subgraphs of G. We suggest a preprocessing that produces an orientation of G. The goal is to exploit this preprocessing for minimizing the radius of the neighborhood around each vertex from which data has to be collected in order to determine a label. We deene a set of labeling problems for which this can be done. The time complexity of labeling a subgraph depends on the topology of the graph G and is always less than minf(G); O((log n) 2)g. On the other hand, we show the existence of a graph for which even unbounded preprocessing does not allow fast solution of a simple labeling problem. Speciically, it is shown that a processor needs to know its (logn= loglog n)-neighborhood in order to pick a label. Finally, we derive some results for the resource allocation problem. In particular, we show that (log n= loglog n) communication rounds are needed if resources are to be fully utilized. In this context, we deene the compact coloring problem, for which the orientation preprocessing provides fast distributed labeling algorithm. This algorithm suggests eecient solution for the resource allocation problem.